(1,0)-Super Solutions of (k,s)-CNF Formula
نویسندگان
چکیده
منابع مشابه
Circuit Based Encoding of CNF Formula
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially translate any formula in conjunctive normal form (CNF) to a circuit sat representation (a conjunction of gates and clauses). Our proposed encoding preserves the satisfiability of the original formula. The set of model...
متن کاملOn Computing k-CNF Formula Properties
The latest generation of SAT solvers (e.g. [9, 5]) generally have three key features: randomization of variable selection, backtracking search, and some form of clause learning. We present a simple algorithm with these three features and prove that for instances with constant ∆ (where ∆ is the clause-to-variable ratio) the algorithm indeed has good worst-case performance, not only for computing...
متن کاملNew CNF Features and Formula Classification
In this paper we first present three new features for classifying CNF formulas. These features are based on the structural information of the formula and consider AND-gates as well as exactly-one constraints. Next, we use these features to construct a machine learning approach to select a SAT solver configuration for CNF formulas with random decision forests. Based on this classification task w...
متن کاملSatisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections
We determine the thresholds for the number of variables, number of clauses, number of clause intersection pairs and the maximum clause degree of a k-CNF formula that guarantees satisfiability under the assumption that every two clauses share at most α variables. More formally, we call these formulas α-intersecting and define, for example, a threshold μi(k, α) for the number of clause intersecti...
متن کاملSuper Solutions for Combinatorial Auctions
Super solutions provide a framework for finding robust solutions to Constraint Satisfaction Problems [5, 3]. We present a novel application of super solutions to combinatorial auctions in which a bid may be disqualified or withdrawn after the winners are announced. We examine the effectiveness of super solutions in different auction scenarios that simulate economically motivated bidding pattern...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2020
ISSN: 1099-4300
DOI: 10.3390/e22020253